By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 14, Issue 3, pp. 621-937

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

First-Order and Second-Order Conditions for Error Bounds

Zili Wu and Jane J. Ye

pp. 621-645

A Globally Convergent Filter Method for Nonlinear Programming

Clóvis C. Gonzaga, Elizabeth Karas, and Márcia Vanti

pp. 646-669

Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems

Kim-Chuan Toh

pp. 670-698

On Steepest Descent Algorithms for Discrete Convex Functions

Kazuo Murota

pp. 699-707

On Accelerated Random Search

M. J. Appel, R. LaBarre, and D. Radulovic

pp. 708-731

Minimization of Error Functionals over Variable-Basis Functions

Paul C. Kainen, Vera Kurková, and Marcello Sanguineti

pp. 732-742

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control

A. Fuduli, M. Gaudioso, and G. Giallombardo

pp. 743-756

Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces

Xi Yin Zheng and Kung Fu Ng

pp. 757-772

Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space

Felipe Alvarez

pp. 773-782

A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems

Jie Sun, Defeng Sun, and Liqun Qi

pp. 783-806

Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

Krzysztof C. Kiwiel

pp. 807-840

Simultaneous Data Perturbations and Analytic Center Convergence

A. Holder

pp. 841-868

A Bundle Method for Solving Variational Inequalities

Geneviève Salmon, Jean-Jacques Strodiot, and Van Hien Nguyen

pp. 869-893

New Preconditioners for KKT Systems of Network Flow Problems

A. Frangioni and C. Gentile

pp. 894-913

Rigorous Lower and Upper Bounds in Linear Programming

Christian Jansson

pp. 914-935

Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

Christian Kanzow and Christian Nagel

pp. 936-937